A Similarity Measure for Cyclic Unary Regular Languages
نویسندگان
چکیده
A cyclic unary regular language is a regular language over a unary alphabet that is represented by a cyclic automaton. We propose a similarity measure for cyclic unary regular languages by modifying the Jaccard similarity coefficient and the Sørensen coefficient to measure the level of overlap between such languages. This measure computes the proportion of strings that are shared by two or more cyclic unary regular languages and is an upper bound of the Jaccard coefficient and the Sørensen coefficient. By using such similarity measure, we define a dissimilarity measure for cyclic unary regular languages that is a semimetric distance. Moreover, it can be used for the non-cyclic case.
منابع مشابه
Computational Complexity of NFA Minimization for Finite and Unary Languages
We investigate the computational complexity of the nondeterministic finite automaton (NFA) minimization problem for finite and unary regular languages, if the input is specified by a deterministic finite state machine. While the general case of this problem is PSPACEcomplete [13], it becomes theoretically easier when restricted to the aforementioned language families. It is easy to see that in ...
متن کاملProbabilistic and Nondeterministic Unary Automata
We investigate unary regular languages and compare deterministic finite automata (DFA’s), nondeterministic finite automata (NFA’s) and probabilistic finite automata (PFA’s) with respect to their size. Given a unary PFA with n states and an -isolated cutpoint, we show that the minimal equivalent DFA has at most n 1 2 states in its cycle. This result is almost optimal, since for any α < 1 a famil...
متن کاملOn the Size of Unary Probabilistic and Nondeterministic Automata
We investigate and compare the descriptional power of unary probabilistic and nondeterministic automata (pfa’s and nfa’s, respectively). We show the existence of a family of languages hard for pfa’s in the following sense: For any positive integer d, there exists a unary d-cyclic language such that any pfa accepting it requires d states, as the smallest deterministic automaton. On the other han...
متن کاملOn Regular Language Factorisation: A Complete Solution for Unary Case
In this paper the problem of regular language decomposition as a concatenation of given regular languages is considered. We prove that the problem is decidable in unary case when all the languages are in single-letter alphabet. This result may be used to give a negative answer in some cases of the general problem.
متن کاملOn the existence of prime decompositions
We investigate factorizations of regular languages in terms of prime languages. A language is said to be strongly prime decomposable if any way of factorizing it yields a prime decomposition in a finite number of steps. We give a characterization of the strongly prime decomposable regular languages and using the characterization we show that every regular language over a unary alphabet has a pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 96 شماره
صفحات -
تاریخ انتشار 2009